Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs

We present a data mining approach for reducing the search space of local search algorithms in a class of binary integer programs including the set covering and partitioning problems. The quality of locally optimal solutions typically improves if a larger neighborhood is used, while the computation time of searching the neighborhood increases exponentially. To overcome this, we extract variable ...

متن کامل

Exploiting Variable Associations to Configure Efficient Local Search in Large-Scale Set Partitioning Problems

We present a data mining approach for reducing the search space of local search algorithms in large-scale set partitioning problems (SPPs). We construct a k-nearest neighbor graph by extracting variable associations from the instance to be solved, in order to identify promising pairs of flipping variables in the large neighborhood search. We incorporate the search space reduction technique into...

متن کامل

Exploiting Variable Dependency in Local Search

Stochastic search has recently been shown to be successful for solving large boolean satissability problems. However, systematic methods tend to be more eeective in problem domains with a large number of dependent variables: that is, variables whose truth values are directly determined by a smaller set of independent variables. In systematic search, truth values can be ee-ciently propagated fro...

متن کامل

Large-Scale Integer Programs in Image Analysis

An important problem in image analysis is to segment an image into regions with di erent class-labels. This is releveant in applications in medicine and cartography. In a proper statistical framework this problem may be viewed as a discrete optimization problem. We present two integer linear programming formulations of the problem and study some properties of these models and associated polytop...

متن کامل

Learning Binary Codes For Efficient Large-Scale Music Similarity Search

Content-based music similarity estimation provides a way to find songs in the unpopular “long tail” of commercial catalogs. However, state-of-the-art music similarity measures are too slow to apply to large databases, as they are based on finding nearest neighbors among very high-dimensional or non-vector song representations that are difficult to index. In this work, we adopt recent machine le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2017

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2017.05.025